Bit on Conjugate Gradient like Methods for Eigen like Problems
نویسندگان
چکیده
Numerical analysts physicists and signal processing engineers have proposed algo rithms that might be called conjugate gradient for problems associated with the com putation of eigenvalues There are many variations mostly one eigenvalue at a time though sometimes block algorithms are proposed Is there a correct conjugate gradi ent algorithm for the eigenvalue problem How are the algorithms related amongst themselves and with other related algorithms such as Lanczos the Newton method and the Rayleigh quotient
منابع مشابه
A New Hybrid Conjugate Gradient Method Based on Eigenvalue Analysis for Unconstrained Optimization Problems
In this paper, two extended three-term conjugate gradient methods based on the Liu-Storey ({tt LS}) conjugate gradient method are presented to solve unconstrained optimization problems. A remarkable property of the proposed methods is that the search direction always satisfies the sufficient descent condition independent of line search method, based on eigenvalue analysis. The globa...
متن کاملA conjugate gradient based method for Decision Neural Network training
Decision Neural Network is a new approach for solving multi-objective decision-making problems based on artificial neural networks. Using inaccurate evaluation data, network training has improved and the number of educational data sets has decreased. The available training method is based on the gradient decent method (BP). One of its limitations is related to its convergence speed. Therefore,...
متن کاملA note on an SOR-like method for augmented systems
Golub et al. (2001, BIT, 41, 71–85) gave a generalized successive over-relaxation method for the augmented systems. In this paper, the connection between the SOR-like method and the preconditioned conjugate gradient (PCG) method for the augmented systems is investigated. It is shown that the PCG method is at least as accurate (fast) as the SOR-like method. Numerical examples demonstrate that th...
متن کاملA Note on the Descent Property Theorem for the Hybrid Conjugate Gradient Algorithm CCOMB Proposed by Andrei
In [1] (Hybrid Conjugate Gradient Algorithm for Unconstrained Optimization J. Optimization. Theory Appl. 141 (2009) 249 - 264), an efficient hybrid conjugate gradient algorithm, the CCOMB algorithm is proposed for solving unconstrained optimization problems. However, the proof of Theorem 2.1 in [1] is incorrect due to an erroneous inequality which used to indicate the descent property for the s...
متن کاملExtensions of the Hestenes-Stiefel and Polak-Ribiere-Polyak conjugate gradient methods with sufficient descent property
Using search directions of a recent class of three--term conjugate gradient methods, modified versions of the Hestenes-Stiefel and Polak-Ribiere-Polyak methods are proposed which satisfy the sufficient descent condition. The methods are shown to be globally convergent when the line search fulfills the (strong) Wolfe conditions. Numerical experiments are done on a set of CUTEr unconstrained opti...
متن کامل